Probabilistic Planning with Information Gathering and Contingent Execution
نویسندگان
چکیده
Most AI representations and algorithms for plan generation have not included the concept of informationproducing actions (also called diagnostics, or tests, in the decision making literature). We present a planning representation and algorithm that models information-producing actions and constructs plans that exploit the information produced by those actions. We extend the buridan (Kushmerick et al. 1994) probabilistic planning algorithm, adapting the action representation to model the behavior of imperfect sensors, and combine it with a framework for contingent action that extends the cnlp algorithm (Peot and Smith 1992) for conditional execution. The result, c-buridan, is an implemented planner that builds plans with probabilistic information-producing actions and contingent execution.
منابع مشابه
A Probabilistic Model of Action for Least-Commitment Planning with Information Gathering
AI planning algorithms have addressed the problem of generating sequences of operators that achieve some input goal, usually assuming that the planning agent has perfect control over and information about the world. Relaxing these assumptions requires an extension to the action representation that allows reasoning both about the changes an action makes and the information it provides. This pape...
متن کاملciently Executing Information - Gathering Plans
We describe Razor, a planning-based information-gathering agent that assists users by automatically determining which Internet information sites are relevant to their query, accessing those sites in parallel, and integrating the results. Razor uses a disjunctive graphbased plan representation. It then uses a novel and powerful form of local completeness reasoning in order to transform those pla...
متن کاملExecuting Information - Gathering Plans
We describe Razor, a planning-based information-gathering agent that assists users by automatically determining which Internet information sites are relevant to their query, accessing those sites in parallel, and integrating the results. Razor uses a disjunctive graphbased plan representation. It then uses a novel and powerful form of local completeness reasoning in order to transform those pla...
متن کاملPlanning with State Uncertainty via Contingency Planning and Execution Monitoring
This paper proposes a fast alternative to POMDP planning for domains with deterministic state-changing actions but probabilistic observation-making actions and partial observability of the initial state. This class of planning problems, which we call quasi-deterministic problems, includes important realworld domains such as planning for Mars rovers. The approach we take is to reformulate the qu...
متن کاملA Probablistic Model of Action for Least-Commitment Planning with Information Gathering
AI planning algorithms have addressed the problem of generating sequences of operators that achieve some input goal, usually assuming that the planning agent has perfect control over and information about the world. Relaxing these assumptions requires an extension to the action representation that allows reasoning both about the changes an action makes and the information it provides. This pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994